//
// Created by Administrator on 2021/8/3.
//
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <climits>

using namespace std;

class Solution {
public:
    int maxCount(int m, int n, vector<vector<int>> &ops) {
        if (ops.empty()) return m * n;
        int minRow = INT_MAX;
        int minCol = INT_MAX;
        for (auto &op:ops) {
            minRow = min(op[0], minRow);
            minCol = min(op[1], minCol);
        }
        return minRow * minCol;
    }
};

int main() {
    vector<vector<int>> ops{{2, 2},
                            {3, 3}};
    Solution solution;
    cout << solution.maxCount(3, 3, ops) << endl;
    return 0;
}
